I/O-efficient triangular range search and its application
نویسندگان
چکیده
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinate axes (xand y-axis). We call such a triangle an axis parallel triangle. For the axis parallel triangular range search problem, we propose a data structure of size O(NB ( log B N log B log B N ) ) disk blocks and a query algorithm of complexity O(logB N( log B N log B log B N ) 2 + K/B) I/Os, where 0 < ǫ < 1, N is the number of points in S, B is the number of points transferred in one I/O, and K is the number of points in the answer to the query. We also consider the application of this data structure and query algorithm to oriented rectangular range search.
منابع مشابه
طراحی بهینه مبتنی بر قابلیت اعتماد سازهها براساس روش شبیهسازی وزنی اصلاح شده
Weighted Simulation-based Design Method (WSDM) is recently developed as an efficient method for Reliability- Based Design Optimization (RBDO). Despite simplicity, this method degrades effectiveness to obtain accurate optimum design for high dimension RBDO. Besides, its application range is restricted to RBDOs including only random design variables. In the present study, local search strategy...
متن کاملA Compromise Ratio Ranking Method of Triangular Intuitionistic Fuzzy Numbers\ and Its Application to MADM Problems
Triangular intuitionistic fuzzy numbers (TIFNs) is a special case of intuitionistic fuzzy (IF) set and the ranking of TIFNs is an important problem. The aim of this paper is to develop a new methodology for ranking TIFNs by using multiattribute decision making methods (MADM). In this methodology, the value and ambiguity indices of TIFNs may be considered as the attributes and the TIFNs in compa...
متن کاملCriticality Considerations in the Design of Geometric Algorithms
We examine a class of geometric problems which all share a feature of considerable relevance: the underlying set is defined implicitly and is at least quadratically larger than the input size. Is efficient computation possible without expanding the set explicitly? If not, are non-trivial lower bounds provable? We give partial answers to these questions by proposing various approaches for attack...
متن کاملPressure-Velocity Coupled Finite Volume Solution of Steady Incompressible Invscid Flow Using Artificial Compressibility Technique
Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. The set of Inviscid Incompressible Euler equations can be applied for wide range of engineering applications. For the steady state problems, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner using...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کامل